翻訳と辞書 Words near each other ・ Topper ・ Topper (comic strip) ・ Topper (dinghy) ・ Topper (film) ・ Topper (sports) ・ Topological order ・ Topological pair ・ Topological property ・ Topological quantum computer ・ Topological quantum field theory ・ Topological quantum number ・ Topological rigidity ・ Topological ring ・ Topological semigroup ・ Topological skeleton ・ Topological sorting ・ Topological space ・ Topological string theory ・ Topological tensor product ・ Topological vector space ・ Topologically Associating Domain ・ Topologically Integrated Geographic Encoding and Referencing ・ Topologically stratified space ・ Topologika ・ TopologiLinux ・ Topologist's sine curve ・ Topology ・ Topology (album) ・ Topology (chemistry) ・ Topology (disambiguation) Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Topological sorting ： ウィキペディア英語版 Topological sorting In the field of computer science, a topological sort (sometimes abbreviated toposort) or topological ordering of a directed graph is a linear ordering of its vertices such that for every directed edge ''uv'' from vertex ''u'' to vertex ''v'', ''u'' comes before ''v'' in the ordering. For instance, the vertices of the graph may represent tasks to be performed, and the edges may represent constraints that one task must be performed before another; in this application, a topological ordering is just a valid sequence for the tasks. A topological ordering is possible if and only if the graph has no directed cycles, that is, if it is a directed acyclic graph (DAG). Any DAG has at least one topological ordering, and algorithms are known for constructing a topological ordering of any DAG in linear time. == Examples == The canonical application of topological sorting (topological order) is in scheduling a sequence of jobs or tasks based on their dependencies; topological sorting algorithms were first studied in the early 1960s in the context of the PERT technique for scheduling in project management . The jobs are represented by vertices, and there is an edge from ''x'' to ''y'' if job ''x'' must be completed before job ''y'' can be started (for example, when washing clothes, the washing machine must finish before we put the clothes to dry). Then, a topological sort gives an order in which to perform the jobs. In computer science, applications of this type arise in instruction scheduling, ordering of formula cell evaluation when recomputing formula values in spreadsheets, logic synthesis, determining the order of compilation tasks to perform in makefiles, data serialization, and resolving symbol dependencies in linkers. It is also used to decide in which order to load tables with foreign keys in databases. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Topological sorting」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.